On automorphism groups of quasiprimitive 2-arc transitive graphs
نویسنده
چکیده
We characterize the automorphism groups of quasiprimitive 2-arc-transitive graphs of twisted wreath product type. This is a partial solution for a problem of Praeger regarding quasiprimitive 2-arc transitive graphs. The solution stimulates several further research problems regarding automorphism groups of edge-transitive Cayley graphs and digraphs.
منابع مشابه
Two-geodesic transitive graphs of prime power order
In a non-complete graph $Gamma$, a vertex triple $(u,v,w)$ with $v$ adjacent to both $u$ and $w$ is called a $2$-geodesic if $uneq w$ and $u,w$ are not adjacent. The graph $Gamma$ is said to be $2$-geodesic transitive if its automorphism group is transitive on arcs, and also on 2-geodesics. We first produce a reduction theorem for the family of $2$-geodesic transitive graphs of prime power or...
متن کاملAn O'nan-scott Theorem for Finite Quasiprimitive Permutation Groups and an Application to 2-arc Transitive Graphs
A permutation group is said to be quasiprimitive if each of its nontrivial normal subgroups is transitive. A structure theorem for finite quasiprimitive permutation groups is proved, along the lines of the O'NanScott Theorem for finite primitive permutation groups. It is shown that every finite, non-bipartite, 2-arc transitive graph is a cover of a quasiprimitive 2-arc transitive graph. The str...
متن کاملAll vertex-transitive locally-quasiprimitive graphs have a semiregular automorphism
The polycirculant conjecture states that every transitive 2-closed permutation group of degree at least two contains a nonidentity semiregular element, that is, a nontrivial permutation whose cycles all have the same length. This would imply that every vertex-transitive digraph with at least two vertices has a nonidentity semiregular automorphism. In this paper we make substantial progress on t...
متن کاملJ ul 2 00 9 1 STRONGLY REGULAR EDGE - TRANSITIVE GRAPHS
In this paper, we examine the structure of vertexand edge-transitive strongly regular graphs, using normal quotient reduction. We show that the irreducible graphs in this family have quasiprimitive automorphism groups, and prove (using the Classification of Finite Simple Groups) that no graph in this family has a holomorphic simple automorphism group. We also find some constraints on the parame...
متن کاملA Family of Non-quasiprimitive Graphs Admitting a Quasiprimitive 2-arc Transitive Group Action
Let 0 be a simple graph and let G be a group of automorphisms of 0. The graph is (G, 2)-arc transitive if G is transitive on the set of the 2-arcs of 0. In this paper we construct a new family of (PSU(3, q2), 2)-arc transitive graphs 0 of valency 9 such that Aut0 = Z3.G, for some almost simple group G with socle PSU(3, q2). This gives a new infinite family of non-quasiprimitive almost simple gr...
متن کامل